package linear_list.leetcode.easy;

/**
 * @Description: 单向链表的结点类
 * @Author Stark
 * @Date 2022/4/1 22:59
 **/
 public class ListNode {
     int val;
     ListNode next;
     ListNode() {}
     ListNode(int val) { this.val = val; }
     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 }
